recursively inseparable sets造句
例句與造句
- Smorynski ( 1977, p . 842 ) shows how the existence of recursively inseparable sets can be used to prove the first incompleteness theorem.
- Briefly, the strategy for proving Tennenbaum's Theorem is based on the " overspill principle ", which guarantees that certain nonstandard numbers " must " exist, and recursively inseparable sets, which guarantee that certain recursive separating sets " cannot " exist.
- The overspill principle is used to show that the desired parameter exists, and if a nonstandard model were to have a recursive coding then a particular bounded-quantifier formula supplied with that parameter and composed with the injection mapping ( from natural numbers to codes for elements of the model ) would be a recursive separator of recursively inseparable sets.
- It's difficult to find recursively inseparable sets in a sentence. 用recursively inseparable sets造句挺難的